A fast algorithm for reliability-oriented task assignment in a distributed system

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Heuristic Algorithm for the Reliability-Oriented File Assignment in a Distributed Computing System

K e y w o r d s F i l e assignment, Distributed computer system (DCS), Memory capacity constraint, Heuristic, Program reliability. 1. I N T R O D U C T I O N D i s t r i b u t e d c o m p u t i n g sys tems (DCS) have become increas ingly popu l a r in recent years , for t he adven t of VLSI t echno logy and low-cost microprocessors has made d i s t r i b u t e d c o m p u t i n g economica l l...

متن کامل

A Customer Oriented Approach for Distribution System Reliability Improvement using Optimal Distributed Generation and Switch Placement

The reliability of distribution networks is inherently low due to their radial nature, consequently distribution companies (DisCos) usually seek to improve the system reliability indices with the minimum possible investment cost. This can be known as system-oriented reliability planning (SORP). However, there can exist some customers that are not satisfied by their reliability determined by ado...

متن کامل

A Heuristic Task Assignment Algorithm to Maximize Reliability of a Distributed System

Conclusions Distributed systems potentially provide high reliability owing to the program and data-file redundancy possible. In many applications, high reliability is the major consideration for system design. Some work by Kumar, Hariri, Raghavendra shows that the distribution of programs and datafiles can affect the system reliability appreciably, and that redundancy in resources such as compu...

متن کامل

A Parallel Algorithm for Optimal Task Assignment in Distributed Systems

An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is well known to be NP-complete, except in a few special cases. Thus heuristics are used to obtain suboptimal solutions in reasonable amount of time. While a plethora of such heuristics have been documented in the literature, ...

متن کامل

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Communications

سال: 2002

ISSN: 0140-3664

DOI: 10.1016/s0140-3664(02)00057-9